Enumerating the Set of Non-dominated Vectors in Multiple Objective Integer Linear Programming

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient cuts for generating the non-dominated vectors for Multiple Objective Integer Linear Programming

While most of the published exact methods for solving multiobjective integer linear programming (MOILP) problems are based on solving many integer linear programs (ILP), we propose a branch and bound multi-objective method to find the whole non-dominated set. Two types of nodes are created in the tree. The first type corresponds to not integer optimal solution of solved (LP) problems . In this ...

متن کامل

Integer Programming Duality in Multiple Objective Programming

The weighted sums approach for linear and convex multiple criteria optimization is well studied. The weights determine a linear function of the criteria approximating a decision makers overall utility. Any efficient solution may be found in this way. This is not the case for multiple criteria integer programming. However, in this case one may apply the more general e-constraint approach, result...

متن کامل

Geometric Duality in Multiple Objective Linear Programming

We develop in this article a geometric approach to duality in Multiple Objective Linear Programming. This approach is based on a very old idea, the duality of polytopes, which can be traced back to the old Greeks. We show that there is an inclusion reversing one-to-one map between the minimal faces of the image of the primal objective and the maximal faces of the image of the dual objective map.

متن کامل

On duality in multiple objective linear programming

We discuss two approaches to duality for multiple objective linear problems. The first approach is based on a duality relation between a set and its complement in the outcome space. It allows us to obtain a number of known duality constructions. The second approach utilizes polarity between a polyhedral set and the epigraph of its support function. It leads to a parametric dual problem which is...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: RAIRO - Operations Research

سال: 2008

ISSN: 0399-0559,1290-3868

DOI: 10.1051/ro:2008018